An Improved GPSR Algorithm Based on Energy Gradient and APIT Grid
نویسندگان
چکیده
منابع مشابه
An Improved Three-dimensional Localization Scheme based on APIT
In wireless sensor networks, location information is essential to its monitoring activities. In view of the “boundary effect” and lack of accuracy in APIT-3D, this paper proposes an improved three-dimensional localization scheme based on APIT named IAPIT-3D. In the scheme, the probability of misjudgment is reduced by adding the conditions of judgment. On one hand, the signal strength that all o...
متن کاملAn Improved GPSR Routing Protocol
The rapid movement of Vehicles which results in frequent changes in vehicle position and speed, as well as inaccuracies in predicting driver’s direction at intersections usually lead to wrong packet forwarding decisions in VANET. Consequently, a routing protocol incorporating vehicle density, moving direction and speed into GPSR in making packet forwarding decisions is hereby proposed. Key data...
متن کاملAn Improved K-means Algorithm based on Mapreduce and Grid
The traditional K-means clustering algorithm is difficult to initialize the number of clusters K, and the initial cluster centers are selected randomly, this makes the clustering results very unstable. Meanwhile, algorithms are susceptible to noise points. To solve the problems, the traditional K-means algorithm is improved. The improved method is divided into the same grid in space, according ...
متن کاملAN IMPROVED INTELLIGENT ALGORITHM BASED ON THE GROUP SEARCH ALGORITHM AND THE ARTIFICIAL FISH SWARM ALGORITHM
This article introduces two swarm intelligent algorithms, a group search optimizer (GSO) and an artificial fish swarm algorithm (AFSA). A single intelligent algorithm always has both merits in its specific formulation and deficiencies due to its inherent limitations. Therefore, we propose a mixture of these algorithms to create a new hybrid optimization algorithm known as the group search-artif...
متن کاملAn Improved Grid-Based K-Means Clustering Algorithm
The traditional K-means clustering algorithm is difficult to initialize the number of clusters K, and the initial cluster centers are selected randomly, this makes the clustering results very unstable. Meanwhile, algorithms are susceptible to noise points. To solve the problems, the traditional K-means algorithm is improved. The improved method is divided into the same grid in space, according ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Sensors
سال: 2016
ISSN: 1687-725X,1687-7268
DOI: 10.1155/2016/2519714